Termination of Associative-Commutative Rewriting by Dependency Pairs
نویسندگان
چکیده
A new criterion for termination of rewriting has been described by Arts and Giesl in 1997. We show how this criterion can be generalized to rewriting modulo associativity and commutativity. We also show how one can build weak AC-compatible reduction orderings which may be used in this criterion.
منابع مشابه
A Dependency Pair Framework for A∨C-Termination
The development of powerful techniques for proving termination of rewriting modulo a set of equations is essential when dealing with rewriting logic-based programming languages like CafeOBJ, Maude, OBJ, etc. One of the most important techniques for proving termination over a wide range of variants of rewriting (strategies) is the dependency pair approach. Several works have tried to adapt it to...
متن کاملProving Termination of Ac-rewriting without Extended Rules
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system without considering the so-called extended rules. However, these methods have important limitations as termination proving tools. To overcome these limitations, more powerful methods like the dependency pairs method...
متن کاملProving Termination of AC - rewriting withoutExtended
Polynomial interpretations and RPO-like orderings allow one to prove termination of Associative and Commutative (AC-)rewriting by only checking the rules of the given rewrite system without considering the so-called extended rules. However, these methods have important limitations as termination proving tools. To overcome these limitations, more powerful methods like the dependency pairs method...
متن کاملAssociative-Commutative Rewriting
We are currently extending the rewrite system labora tory REVE to handle associative-commutative operators. In particular, we are incorporating a set of rules for Boolean algebra that provides a refutationally-complete theorem prover and a new programming paradigm. To that end, we describe methods for proving termination of associativecommutative systems.
متن کاملThe Hierarchy of Dependency Pairs
abstract: Recently, dependency pairs have greatly extended the provable class of terminating of term rewriting systems. The set of dependency pairs itself makes a term rewriting system. However, a term rewriting system and its dependency pairs do not accurately agree on the termination property. In this paper, we study the relation for the termination property between a term rewriting system, t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998